<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    583. Delete Operation for Two Strings
   </h1>
   <p>
    Given two words
    <i>
     word1
    </i>
    and
    <i>
     word2
    </i>
    , find the minimum number of steps required to make
    <i>
     word1
    </i>
    and
    <i>
     word2
    </i>
    the same, where in each step you can delete one character in either string.
   </p>
   <p>
    <b>
     Example 1:
    </b>
    <br>
   </p>
   <pre>
<b>Input:</b> "sea", "eat"
<b>Output:</b> 2
<b>Explanation:</b> You need one step to make "sea" to "ea" and another step to make "eat" to "ea".
</pre>
   <p>
    <b>
     Note:
    </b>
    <br>
   </p>
   <ol>
    <li>
     The length of given words won't exceed 500.
    </li>
    <li>
     Characters in given words can only be lower-case letters.
    </li>
   </ol>
  </div>
  <div>
   <h1 class="question_title">
    583. 两个字符串的删除操作
   </h1>
   <p>
    给定两个单词&nbsp;
    <em>
     word1&nbsp;
    </em>
    和&nbsp;
    <em>
     word2
    </em>
    ，找到使得&nbsp;
    <em>
     word1&nbsp;
    </em>
    和&nbsp;
    <em>
     word2&nbsp;
    </em>
    相同所需的最小步数，每步可以删除任意一个字符串中的一个字符。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre>
<strong>输入:</strong> "sea", "eat"
<strong>输出:</strong> 2
<strong>解释:</strong> 第一步将"sea"变为"ea"，第二步将"eat"变为"ea"
</pre>
   <p>
    <strong>
     说明:
    </strong>
   </p>
   <ol>
    <li>
     给定单词的长度不超过500。
    </li>
    <li>
     给定单词中的字符只含有小写字母。
    </li>
   </ol>
  </div>
 </body>
</html>